Computing Cliques is Intractable
نویسنده
چکیده
(i) a theorem that is closely related to Erdös and Rado’s sunflower lemma, and claims a stronger statement in most cases, (ii) a new approach to prove the exponential monotone circuit complexity of the clique problem, (iii) NC 6= NP through the impossibility of a Boolean circuit with poly-log depth to compute cliques, based on the conctruction of (ii), and (iv) P 6= NP through the exponential circuit complexity of the clique problem, based on the construction of (iii).
منابع مشابه
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even, say 6-cliques) the problem quickly becomes intractable because of combinatorial explosion. Most methods used for triangle counting do not scale for large cl...
متن کاملCliques Role in Organizational Reputational Influence: A Social Network Analysis
Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...
متن کاملA Novel on-Line Tracking Method Based on Superpixels Cliques
In this paper, we propose a super-pixels clique based tracking algorithm to perform track task, meanwhile it can robustly handle the appearance change of target object and heavy occlusion. By two stage adaptive appearance modeling method, we propose the method of learning the target-background appearance framework ,which is based on super pixels principle histogram bins cluster method. The proc...
متن کاملParameterized Clique on Scale-Free Networks
Finding cliques in graphs is a classical problem which is in general NP-hard and parameterized intractable. However, in typical applications like social networks or protein-protein interaction networks, the considered graphs are scale-free, i.e., their degree sequence follows a power law. Their specific structure can be algorithmically exploited and makes it possible to solve clique much more e...
متن کاملConstrained speaker linking
In this paper we study speaker linking (a.k.a. partitioning) given constraints of the distribution of speaker identities over speech recordings. Specifically, we show that the intractable partitioning problem becomes tractable when the constraints pre-partition the data in smaller cliques with non-overlapping speakers. The surprisingly common case where speakers in telephone conversations are k...
متن کامل